Search results for "Precedence diagram method"

showing 3 items of 3 documents

Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres

2012

Abstract In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi-mode resource-constrained project scheduling problem with pre-emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowi…

Rate-monotonic schedulingService (systems architecture)Information Systems and ManagementPrecedence diagram methodGeneral Computer ScienceOperations researchComputer scienceDistributed computingDynamic priority schedulingSchedule (project management)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringFair-share schedulingFixed-priority pre-emptive schedulingGenetic algorithm schedulingModeling and SimulationTwo-level schedulingEuropean Journal of Operational Research
researchProduct

Handling precedence constraints in scheduling problems by the sequence pair representation

2015

In this paper, we show that sequence pair (SP) representation, primarily applied to the rectangle packing problems appearing in the VLSI industry, can be a solution representation of precedence constrained scheduling. We present three interpretations of sequence pair, which differ in complexity of schedule evaluation and size of a corresponding solution space. For each interpretation we construct an incremental precedence constrained SP neighborhood evaluation algorithm, computing feasibility of each solution in the insert neighborhood in an amortized constant time per examined solution, and prove the connectivity property of the considered neighborhoods. To compare proposed interpretations…

Mathematical optimizationPrecedence diagram methodControl and Optimizationrectangle packing problemMultiprocessing0102 computer and information sciences02 engineering and technology01 natural sciencesScheduling (computing)0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsschedulingComputer Science::Operating SystemsMathematicsVery-large-scale integrationAmortized analysisApplied MathematicsJob scheduling problemComputer Science ApplicationsComputational Theory and Mathematics010201 computation theory & mathematicsMetaheuristic algorithmsTheory of computation020201 artificial intelligence & image processingAlgorithmprecedence constraintssequence pairJournal of Combinatorial Optimization
researchProduct

A heuristic algorithm for project scheduling with splitting allowed

1996

In this article, we analyze the precedence diagramming method, the only published algorithm for time-only project scheduling with activity splitting allowed. The criteria used in this method (forward and backward pass computations) for deciding when an activity has to be interrupted are shown to be invalid in some situations. We look into the causes of these failures and propose new formulae that always provide feasible solutions. The new algorithm has been tested on 240 randomly generated problems ranging up to 600 activities and 7,200 precedence relationships, resulting in an average deviation from optima of less than 1 percent.

Absolute deviationMathematical optimizationControl and OptimizationPrecedence diagram methodArtificial IntelligenceComputer Networks and CommunicationsComputer scienceComputationRangingManagement Science and Operations ResearchAlgorithmSoftwareInformation SystemsJournal of Heuristics
researchProduct